Finite and Uniform Stability of Sphere Packings
نویسندگان
چکیده
The main purpose of this paper is to discuss how firm or steady certain known ball packing are, thinking of them as structures. This is closely related to the property of being locally maximally dense. Among other things we show that many of the usual best-known candidates, for the most dense packings with congruent spherical balls, have the property of being uniformly stable, i.e., for a sufficiently small ε > 0 every finite rearrangement of the balls of this packing, where no ball is moved more than ε, is the identity rearrangement. For example, the lattice packings D d and A d for d ≥ 3 in E d are all uniformly stable. The methods developed here can work for many other packings as well. We also give a construction to show that the densest cubic lattice ball packing in E d for d ≥ 2 is not uniformly stable. A packing of balls is called finitely stable if any finite subfamily of the packing is fixed by its neighbors. If a packing is uniformly stable, then it is finitely stable. On the other hand, the cubic lattice packings mentioned above, which are not uniformly stable, are nevertheless finitely stable.
منابع مشابه
Sphere packings revisited
In this paper we survey most of the recent and often surprising results on packings of congruent spheres in d-dimensional spaces of constant curvature. The topics discussed are as follows: Hadwiger numbers of convex bodies and kissing numbers of spheres; Touching numbers of convex bodies; Newton numbers of convex bodies; One-sided Hadwiger and kissing numbers; Contact graphs of finite packings ...
متن کاملMaximizing the Packing Density on a Class of Almost Periodic Sphere Packings
We consider the variational problem of maximizing the packing density on some finite dimensional set of almost periodic sphere packings. We show that the maximal density on this manifold is obtained by periodic packings. Since the density is a continuous, but a nondifferentiable function on this manifold, the variational problem is related to number theoretical questions. Every sphere packing i...
متن کاملDeriving Finite Sphere Packings
Sphere packing problems have a rich history in both mathematics and physics; yet, relatively few analytical analyses of sphere packings exist, and answers to seemingly simple questions are unknown. Here, we present an analytical method for deriving all packings of n spheres in R3 satisfying minimal rigidity constraints (≥ 3 contacts per sphere and ≥ 3n− 6 total contacts). We derive such packing...
متن کاملDisks vs. Spheres: Contrasting Properties of Random Packings
Collections of random packings of rigid disks and spheres have been generated by computer using a previously described concurrent algorithm. Particles begin as infinitesimal moving points, grow in size at a uniform rate, undergo energynonconserving collisions, and eventually jam up. Periodic boundary conditions apply, and various numbers of particles have been considered (N~<2000 for disks, N~<...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 20 شماره
صفحات -
تاریخ انتشار 1998